LBLS: A Locality Bounded Hashing-Based Location Service

نویسندگان

  • Ruonan Rao
  • Shuying Liang
  • Jinyuan You
چکیده

For supporting the grid computing in dynamic network environment composed of multi-clusters, a continuance parallel computation grid (CPCG) is proposed in this paper. A series of formal definitions, such as the CPCG architecture, the dynamic network environment (DNE), the management agent system, the independent computing agents (ICA) which support the traditional computing (TC), the cooperation computing team (CCT) which supports the data parallel computing (DPC), and their relations are given. Through DPC, TC, and the migration mechanism, the continuance data parallel computing (CDPC) was constructed. The dynamic learning method, the fuzzy partition technique for the logical computer cluster on which CCT runs, the stage checkpoint mechanism and the migration process are studied. CPCG computing process is described. The experiment results show that CPCG resolves effectively the problems of optimization use of resources in DNE. It can be fit for grid computing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HTL: A Locality Bounded Flat Hash Location Service

Many location services have been proposed, but some challenges remain. In this paper, we present a new location service, named HTL (Hash Table Localized) to solve the locality problem, that in a location service, the location information can be stored potentially far away from both the source and destination nodes, even when the source and destination nodes are close. As a result, it causes hig...

متن کامل

Identifying contributors in the BBC world service archive

In this paper we describe the speaker identification feature of the BBC World Service Archive prototype, an experiment run by BBC R&D to investigate alternative ways of publishing large radio archives. This feature relies on diarization of individual programmes, supervector-based speaker models, crowdsourcing for speaker identities, and a fast distributed index based on Locality Sensitive Hashi...

متن کامل

Price of Anarchy, Locality Gap, and a Network Service Provider Game

In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related facility location problem called the k-facility location problem. As a result, we show that the kfacility location problem has a locality gap of 5. This result is of interest on its own. Our result gives evidence to th...

متن کامل

Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing

By replacing the brute-force list search in sieving algorithms with Charikar’s angular localitysensitive hashing (LSH) method, we get both theoretical and practical speedups for solving the shortest vector problem (SVP) on lattices. Combining angular LSH with a variant of Nguyen and Vidick’s heuristic sieve algorithm, we obtain heuristic time and space complexities for solving SVP in dimension ...

متن کامل

On fast bounded locality sensitive hashing

In this paper, we examine the hash functions expressed as scalar products, i.e., f(x) =< v, x >, for some bounded random vector v. Such hash functions have numerous applications, but often there is a need to optimize the choice of the distribution of v. In the present work, we focus on so-called anti-concentration bounds, i.e. the upper bounds of P [| < v, x > | < α]. In many applications, v is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JNW

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2010